The Smallest Rounded Sets of Binary Matroids
نویسندگان
چکیده
منابع مشابه
Rough Sets and Matroids
We prove the recent result of Liu and Zhu [2] and discuss some consequences of that and related facts for the development of rough set theory.
متن کاملSatisfiability of the Smallest Binary Program
trum f ¨ ur K ¨ unstliche Intelligenz, DFKI) with sites in Kaiserslautern and Saarbrücken is a non-profit organization which was founded in 1988. The shareholder com-search projects conducted at the DFKI are funded by the German Ministry for Research and Technology, by the shareholder companies, or by other industrial contracts. The DFKI conducts application-oriented basic research in the field...
متن کاملThe asymptotic number of binary codes and binary matroids
The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.
متن کاملThe Cocycle Lattice of Binary Matroids
We study the lattice (grid) generated by the incidence vectors of cocycles of a binary matroid and its dual lattice. We characterize those binary matroids for which the obvious necessary conditions for a vector to belong to the cocycle lattice are also sufficient. This characterization yields a polynomial time algorithm to check whether a matroid has this property, and also to construct a basis...
متن کاملThe cocycle lattice of binary matroids , II
We continue the study initiated in [LS] of the lattice (grid) generated by the incidence vectors of cocycles of a binary matroid and its dual lattice. In [LS], we proved that every denominator in the dual lattice is a power of 2, and characterized those binary matroids M for which the largest exponent k(M) is 1. In this paper, we characterize the matroids with k(M) = 2 and, for each constant k,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1990
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(13)80055-8